An efficient full-wave solver for eddy currents

نویسندگان

چکیده

An integral equation reformulation of the Maxwell transmission problem is presented. The uses techniques such as tuning free parameters and augmentation close-to-rank-deficient operators. It designed for eddy current regime works both surfaces genus 0 1. Well-conditioned systems field representations are obtained despite being ill-conditioned 1 due to presence Neumann eigenfields. Furthermore, it shown that these eigenfields, ordinary conductors in regime, different from classical eigenfields superconductors. Numerical examples, based on reformulation, give an unprecedented 13-digit accuracy transmitted scattered fields.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An efficient semi-implicit compressible solver for large-eddy simulations

In most combustion devices, the Mach number is small, and the most efficient computational approach is the solving of the low-Mach number formulation of the Navier-Stokes equations. In this approach, the acoustic waves propagate at an infinite speed. Nevertheless, when the acoustic speed plays an important role, as in the formation of instabilities, the compressible Navier-Stokes equations must...

متن کامل

Efficient GPU-Based Solver for Acoustic Wave Equation

We present an efficient algorithm to solve the acoustic wave equation that is used to model the propagation of sound waves through a material medium. Our approach assumes that the speed of sound is constant in the medium and computes an adaptive rectangular decomposition(ARD) of the environment. We map the algorithm to many-core GPU architectures by performing discrete cosine transforms (DCTs) ...

متن کامل

An Approximate, Efficient Solver for LP Rounding

The vertex cover problem Find a set of vertices that cover the graph LP rounding is a 4 step scheme to approximate combinatorial problems with theoretical guarantees on solution quality. Several problems in machine learning, computer vision and data analysis can be formulated using NP-­‐hard combinatorial optimization problems. In many of these applications, approximate solutions for these NP-­...

متن کامل

An efficient solver for weighted Max-SAT

We present a new branch and bound algorithm for weighted Max-SAT, called 1 Lazy which incorporates original data structures and inference rules, as well as a lower 2 bound of better quality. We provide experimental evidence that our solver is very competi3 tive and outperforms some of the best performing Max-SAT and weighted Max-SAT solvers 4 on a wide range of instances. 5

متن کامل

An efficient SMT solver for string constraints

An increasing number of applications in verification and security rely on or could benefit from automatic solvers that can check the satisfiability of constraints over a diverse set of data types that includes character strings. Until recently, satisfiability solvers for strings were standalone tools that could reason only about fairly restricted fragments of the theory of strings and regular e...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Computers & mathematics with applications

سال: 2022

ISSN: ['0898-1221', '1873-7668']

DOI: https://doi.org/10.1016/j.camwa.2022.10.018